Enumeration of symmetric ( 45 , 12 , 3 ) designs with nontrivial automorphisms ∗
نویسنده
چکیده
We show that there are exactly 4285 symmetric (45,12,3) designs that admit nontrivial automorphisms. Among them there are 1161 self-dual designs and 1562 pairs of mutually dual designs. We describe the full automorphism groups of these designs and analyze their ternary codes. R. Mathon and E. Spence have constructed 1136 symmetric (45,12,3) designs with trivial automorphism group, which means that there are at least 5421 symmetric (45,12,3) designs. Further, we discuss trigeodetic graphs obtained from the symmetric (45, 12, 3) designs. We prove that k-geodetic graphs constructed from mutually non-isomorphic designs are mutually non-isomorphic, hence there are at least 5421 mutually non-isomorphic trigeodetic graphs obtained from symmetric (45, 12, 3) designs. 2010 MSC: 05B05, 20D45, 94B05, 05C38
منابع مشابه
Automorphism Group of a Possible 2-(121, 16, 2) Symmetric Design
Let D be a symmetric 2-(121, 16, 2) design with the automorphism group of Aut(D). In this paper the order of automorphism of prime order of Aut(D) is studied, and some results are obtained about the number of fixed points of these automorphisms. Also we will show that |Aut(D)|=2p 3q 5r 7s 11t 13u, where p, q, r, s, t and u are non-negative integers such that r, s, t, u ? 1. In addition we prese...
متن کاملA computer approach to the enumeration of block designs which are invariant with respect to a prescribed permutation group
We present a new approach to the construction of simple block designs. Using the computer package DISCRETA, we start with the construction of block designs which are invariant with respect to some prescribed group of automorphisms. Therefore, one applies the method of Kramer and Mesner which means that one has to solve systems of diophantine equations to get the designs. DISCRETA has proven its...
متن کاملThere are exactly five biplanes with k=11
A biplane is a 2-(k(k − 1)/2 + 1, k, 2) symmetric design. Only sixteen nontrivial biplanes are known: there are exactly nine biplanes with k < 11, at least five biplanes with k = 11, and at least two biplanes with k = 13. It is here shown by exhaustive computer search that the list of five known biplanes with k = 11 is complete. This result further implies that there exists no 3-(57, 12, 2) des...
متن کاملNo 17-player Triplewhist Tournament Has Nontrivial Automorphisms
The existence of triplewhist tournaments for v players has recently been solved for all values of v except v = 17. For v = 12 and v = 13 a complete enumeration has shown the nonexistence of TWh (v), while constructions of TWh (v) have been presented for v > 17. For several values of v existence has been shown by constructing a TWh (v) with a prescribed, usually cyclic, automorphism group. In th...
متن کاملSteiner 2-designs S(2, 4, 28) with Nontrivial Automorphisms
In this article designs with parameters S(2, 4, 28) and nontrivial automorphism groups are classified. A total of 4466 designs were found. Together with some S(2, 4, 28)’s with trivial automorphism groups found by A.Betten, D.Betten and V.D.Tonchev this sums up to 4653 nonisomorphic S(2, 4, 28) designs.
متن کامل